Strong, Strongly Universal and Weak Interval Eigenvectors in Max-Plus Algebra

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eigenvectors of interval matrices over max-plus algebra

The behaviour of a discrete event dynamic system is often conveniently described using a matrix algebra with operations max and plus Such a system moves forward in regular steps of length equal to the eigenvalue of the system matrix if it is set to operation at time instants corresponding to one of its eigenvectors However due to imprecise measurements it is often unappropriate to use exact mat...

متن کامل

Weak CSR expansions and transience bounds in max-plus algebra

This paper aims to unify and extend existing techniques for deriving upper bounds on the transient of max-plus matrix powers. To this aim, we introduce the concept of weak CSR expansions: A = CSR⊕B. We observe that most of the known bounds (implicitly) take the maximum of (i) a bound for the weak CSR expansion to hold, which does not depend on the values of the entries of the matrix but only on...

متن کامل

Max-Plus algebra on tensors and its properties

In this paper we generalize the max plus algebra system of real matrices to the class of real tensors and derive its fundamental properties. Also we give some basic properties for the left (right) inverse, under the new system. The existence of order 2 left (right) inverses of tensors is characterized.

متن کامل

Max-plus algebra

The max-plus semiring Rmax is the set R∪{−∞}, equipped with the addition (a, b) 7→ max(a, b) and the multiplication (a, b) 7→ a + b. The identity element for the addition, zero, is −∞, and the identity element for the multiplication, unit, is 0. To illuminate the linear algebraic nature of the results, the generic notations +, , × (or concatenation), 0 and 1 are used for the addition, the sum, ...

متن کامل

Cyclic jobshop problem and (max,plus) algebra

In this paper, we focus on the cyclic job-shop problem. This problem consists in determining the order of a set of generic tasks on machines in order to minimize the cycle time of the sequence. We propose an exact method to solve this problem. For each solution, a linear max-plus model (possibly non causal) is obtained. To evaluate the performance of a considered schedule, we build the causal m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics

سال: 2020

ISSN: 2227-7390

DOI: 10.3390/math8081348